Computation of Similarity—Similarity Search as Computation
Identifieur interne : 000495 ( Main/Exploration ); précédent : 000494; suivant : 000496Computation of Similarity—Similarity Search as Computation
Auteurs : Stoyan Mihov [Bulgarie] ; U. Schulz [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: We present a number of applications in Natural Language Processing where the main computation consists of a similarity search for an input pattern in a large database. Afterwards we describe some efficient methods and algorithms for solving this computational challenge. We discuss the view of the similarity search as a special kind of computation, which is remarkably common in applications of Computational Linguistics.
Url:
DOI: 10.1007/978-3-642-21875-0_21
Affiliations:
- Allemagne, Bulgarie
- Bavière, District de Haute-Bavière, Sofia-ville (oblast)
- Munich, Sofia
- Université Louis-et-Maximilien de Munich
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000F96
- to stream Istex, to step Curation: 000F47
- to stream Istex, to step Checkpoint: 000152
- to stream Main, to step Merge: 000501
- to stream Main, to step Curation: 000495
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Computation of Similarity—Similarity Search as Computation</title><author><name sortKey="Mihov, Stoyan" sort="Mihov, Stoyan" uniqKey="Mihov S" first="Stoyan" last="Mihov">Stoyan Mihov</name></author><author><name sortKey="Schulz, U" sort="Schulz, U" uniqKey="Schulz U" first="U." last="Schulz">U. Schulz</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C2528823411CD382C2B6F7BA82135698153430B2</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-21875-0_21</idno><idno type="url">https://api.istex.fr/document/C2528823411CD382C2B6F7BA82135698153430B2/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000F96</idno><idno type="wicri:Area/Istex/Curation">000F47</idno><idno type="wicri:Area/Istex/Checkpoint">000152</idno><idno type="wicri:doubleKey">0302-9743:2011:Mihov S:computation:of:similarity</idno><idno type="wicri:Area/Main/Merge">000501</idno><idno type="wicri:Area/Main/Curation">000495</idno><idno type="wicri:Area/Main/Exploration">000495</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Computation of Similarity—Similarity Search as Computation</title><author><name sortKey="Mihov, Stoyan" sort="Mihov, Stoyan" uniqKey="Mihov S" first="Stoyan" last="Mihov">Stoyan Mihov</name><affiliation wicri:level="3"><country xml:lang="fr">Bulgarie</country><wicri:regionArea>Institute for Parallel Processing, Bulgarian Academy of Sciences, 25A, Acad. G. Bonchev St, 1113, Sofia</wicri:regionArea><placeName><settlement type="city">Sofia</settlement><region nuts="2">Sofia-ville (oblast)</region></placeName></affiliation></author><author><name sortKey="Schulz, U" sort="Schulz, U" uniqKey="Schulz U" first="U." last="Schulz">U. Schulz</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Centrum für Informations- und Sprachverarbeitung, Ludwig-Maximilians-Universität München, Oettingenstr. 67, 80538, München</wicri:regionArea><placeName><region type="land" nuts="1">Bavière</region><region type="district" nuts="2">District de Haute-Bavière</region><settlement type="city">Munich</settlement></placeName><orgName type="university">Université Louis-et-Maximilien de Munich</orgName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">C2528823411CD382C2B6F7BA82135698153430B2</idno><idno type="DOI">10.1007/978-3-642-21875-0_21</idno><idno type="ChapterID">21</idno><idno type="ChapterID">Chap21</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present a number of applications in Natural Language Processing where the main computation consists of a similarity search for an input pattern in a large database. Afterwards we describe some efficient methods and algorithms for solving this computational challenge. We discuss the view of the similarity search as a special kind of computation, which is remarkably common in applications of Computational Linguistics.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Bulgarie</li></country><region><li>Bavière</li><li>District de Haute-Bavière</li><li>Sofia-ville (oblast)</li></region><settlement><li>Munich</li><li>Sofia</li></settlement><orgName><li>Université Louis-et-Maximilien de Munich</li></orgName></list><tree><country name="Bulgarie"><region name="Sofia-ville (oblast)"><name sortKey="Mihov, Stoyan" sort="Mihov, Stoyan" uniqKey="Mihov S" first="Stoyan" last="Mihov">Stoyan Mihov</name></region></country><country name="Allemagne"><region name="Bavière"><name sortKey="Schulz, U" sort="Schulz, U" uniqKey="Schulz U" first="U." last="Schulz">U. Schulz</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000495 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000495 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:C2528823411CD382C2B6F7BA82135698153430B2
|texte= Computation of Similarity—Similarity Search as Computation
}}
| This area was generated with Dilib version V0.6.32. |  |